Finite abelian groups and factorization problems
نویسندگان
چکیده
منابع مشابه
factorization numbers of finite abelian groups
the number of factorizations of a finite abelian group as the product of two subgroups is computed in two different ways and a combinatorial identity involving gaussian binomial coefficients is presented.
متن کاملTriple factorization of non-abelian groups by two maximal subgroups
The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...
متن کاملFinite $p$-groups and centralizers of non-cyclic abelian subgroups
A $p$-group $G$ is called a $mathcal{CAC}$-$p$-group if $C_G(H)/H$ is cyclic for every non-cyclic abelian subgroup $H$ in $G$ with $Hnleq Z(G)$. In this paper, we give a complete classification of finite $mathcal{CAC}$-$p$-groups.
متن کاملThe Factorization of Abelian Groups
If G is a nite abelian group and n > 1 is an integer, we say that G is n-good, if from each factorizationG = A1A2 An of G into direct product of subsets, it follows that at least one of the subsets Ai is periodic, in the sense that there exists x 2 G feg such that xAi = Ai. In this paper, we shall study some 3-groups with respect to this property. Acta Mathematica Academiae Paedagogicae Ny regy...
متن کاملDecomposing finite Abelian groups
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1979
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-42-1-319-330